Conjugate gradient algorithms for conic functions
نویسندگان
چکیده
منابع مشابه
Implementation of Conjugate Gradient Algorithms
We evaluate the High-Performance Fortran (HPF) language for the compact expression and eecient implementation of conjugate gradient iterative matrix-solvers on High Performance Computing and Communi-cations(HPCC) platforms. We discuss the use of intrinsic functions, data distribution directives and explicitly parallel constructs to optimize performance by minimizing communications requirements ...
متن کاملGPU-Based Parallel Nonlinear Conjugate Gradient Algorithms
In this paper we describe some parallel algorithms for solving nonlinear systems using CUDA (Compute Unified Device Architecture) over a GPU (Graphics Processing Unit). The proposed algorithms are based on both the Fletcher-Reeves version of the nonlinear conjugate gradient method and a polynomial preconditioner type based on block two-stage methods. Several strategies of parallelization and di...
متن کاملSet-Membership Constrained Conjugate Gradient Beamforming Algorithms
In this work a constrained adaptive filtering strategy based on conjugate gradient (CG) and set-membership (SM) techniques is presented for adaptive beamforming. A constraint on the magnitude of the array output is imposed to derive an adaptive algorithm that performs data-selective updates when calculating the beamformer’s parameters. We consider a linearly constrained minimum variance (LCMV) ...
متن کاملConjugate Gradient Algorithms Using Multiple Recursions
Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuuel 3] gave necessary and suucient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all po...
متن کاملAnalysis of Parallel Preconditioned Conjugate Gradient Algorithms
The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient algorithms. First, a theoretical model is proposed for estimation of the complexity of PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1986
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1986.104222